#include <iostream>
#include <queue>
#include <cstring>
using namespace std;
const int MAXN = 1005;
const int INF = 1e9;
int n, m;
int map[MAXN][MAXN];
int dx[4] = {0, 1, 0, -1}; // 方向数组，右、下、左、上
int dy[4] = {1, 0, -1, 0};
int dist[MAXN][MAXN][105]; // 距离数组，记录每个位置每个方向的最小拐弯次数
struct State {
int x, y, dir, turns;
};
bool isValid(int x, int y) {
return x >= 0 && x < n && y >= 0 && y < m && map[x][y] == 0;
}
int bfs(int x1, int y1, int x2, int y2) {
queue<State> q;
for (int i = 0; i < 4; ++i) {
dist[x1][y1][i] = 0;
q.push({x1, y1, i, 0});
}
}
int main() {
cin >> n >> m;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> map[i][j];
for (int k = 0; k < 4; ++k) {
dist[i][j][k] = INF;
}
}
}
}
